On a problem of Győry and Schinzel concerning polynomials
نویسندگان
چکیده
منابع مشابه
On a Problem concerning Permutation Polynomials
Let S(f) denote the set of integral ideals / such that / is a permutation polynomial modulo i", where / is a polynomial over the ring of integers of an algebraic number field. We obtain a classification for the sets S which may be written in the form S(f). Introduction. A polynomial f(x) with coefficients in a commutative ring R is said to be a permutation polynomial modulo an ideal I oi R (abb...
متن کاملOn a problem of Byrnes concerning polynomials with restricted coefficients
We consider a question of Byrnes concerning the minimal degree n of a polynomial with all coefficients in {−1, 1} which has a zero of a given order m at x = 1. For m ≤ 5, we prove his conjecture that the monic polynomial of this type of minimal degree is given by ∏m−1 k=0 (x 2 − 1), but we disprove this for m ≥ 6. We prove that a polynomial of this type must have n ≥ e √ m(1+o(1)), which is in ...
متن کاملAn Extremu M Problem concerning Algebraic Polynomials
Let S " he the set of all polynomials whose degree does not exceed n and whose all zeros are real but lie outside (-1, 1). Similarly, we say p"E Q " if p,(x) is a real polynomial whose all zeros lie outside the open disk with center at the origin and radius l. Further we will denote by H " the set of all polynomials of degree-n and of the form k=O where q,,k (x) = (1 +x)k (l-x)"-'. Elements of ...
متن کاملOn composite lacunary polynomials and the proof of a conjecture of Schinzel
Let g(x) be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if g(h(x)) has boundedly many terms, then h(x) ∈ C[x] must also have boundedly many terms. Solving an older conjecture raised by Rényi and by Erdös, Schinzel had proved this in the special cases g(x) = x; however that method does not extend to the general case. Here we prove the full Schinzel’s conjecture (...
متن کاملOn a problem of Byrnes concerning polynomials with restricted coefficients, II
As in the earlier paper with this title, we consider a question of Byrnes concerning the minimal length N∗(m) of a polynomial with all coefficients in {−1, 1} which has a zero of a given order m at x = 1. In that paper we showed that N∗(m) = 2m for all m ≤ 5 and showed that the extremal polynomials for were those conjectured by Byrnes, but for m = 6 that N∗(6) = 48 rather than 64. A polynomial ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1997
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-78-3-287-295